Every category is a factorization of a concrete one

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Modules for which every non-cosingular submodule is a summand

‎A module $M$ is lifting if and only if $M$ is amply supplemented and‎ ‎every coclosed submodule of $M$ is a direct summand‎. ‎In this paper‎, ‎we are‎ ‎interested in a generalization of lifting modules by removing the condition‎"‎amply supplemented‎" ‎and just focus on modules such that every non-cosingular‎ ‎submodule of them is a summand‎. ‎We call these modules NS‎. ‎We investigate some gen...

متن کامل

Menger probabilistic normed space is a category topological vector space

In this paper, we formalize the Menger probabilistic normed space as a category in which its objects are the Menger probabilistic normed spaces and its morphisms are fuzzy continuous operators. Then, we show that the category of probabilistic normed spaces is isomorphicly a subcategory of the category of topological vector spaces. So, we can easily apply the results of topological vector spaces...

متن کامل

Every Sequence Is Decompressible from a Random One

Kučera and Gács independently showed that every infinite sequence is Turing reducible to a Martin-Löf random sequence. This result is extended by showing that every infinite sequence S is Turing reducible to a Martin-Löf random sequence R such that the asymptotic number of bits of R needed to compute n bits of S, divided by n, is precisely the constructive dimension of S. It is shown that this ...

متن کامل

Every class of $S$-acts having a flatness property is closed under directed colimits

Let $S$ be a monoid. In this paper, we prove every class of $S$-acts having a flatness property is closed underdirected colimits, it extends some known results. Furthermore thisresult implies that every $S$-act has a flatness cover if and only if it has a flatness precover.

متن کامل

Every Sequence Is Reducible to a Random One

Charles Bennett asked whether every infinite binary sequence can be obtained from an "incompressible" one by a Turing machine, He proved that this is the case for arithmetical sequences. The question has some philosophical interest because it permits us to view even very pathological sequences as the result of the combination of two relatively wellunderstood processes: the completely chaotic ou...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Pure and Applied Algebra

سال: 1971

ISSN: 0022-4049

DOI: 10.1016/0022-4049(71)90004-1